Conservative Quantum Computing

Conservative quantum computing.

The Wigner-Araki-Yanase theorem shows that conservation laws limit the accuracy of measurement. Here, we generalize the argument to show that conservation laws limit the accuracy of quantum logic operations. A rigorous lower bound is obtained of the error probability of any physical realization of the controlled-NOT gate under the constraint that the computational basis is represented by a comp...

Quantum conservative many-valued computing

In this paper we extend the basic principles and results of conservative logic to include the main features of many-valued logics with a finite number of truth values. Different approaches to many-valued logics are examined in order to determine some possible functionally complete sets of logic connectives. As a result, we describe some possible finite-valued universal gates which realize a fun...

Towards a Theory of Conservative Computing

We extend the notion of conservativeness, given by Fredkin and Toffoli in 1982, to generic gates whose input and output lines may assume a finite number d of truth values. A physical interpretation of conservativeness in terms of conservation of the energy associated to the data used during the computation is given. Moreover, we define conservative computations, and we show that they naturally ...

On the Computational Complexity of Conservative Computing

Quantum Computing

uantum computers will utilize nonclassical logic operations to perform numerical calculations that are not feasible on conventional computers. The enhanced capabilities of quantum computers result partly from their expected ability to perform many different calculations simultaneously on a single processor. The Applied Physics Laboratory is developing an optical approach to quantum computing. (